Measurement Based Optimal Source Shaping with a Shaping+Multiplexing Delay Constraint - INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies
نویسندگان
چکیده
Most on-line (i.e., not stored) Variable Bit Rate sources would find it difficult to a priori declare the traffic parameters required by a connection admission control strategy. There is thus the problem of measurement based on-line estimation of source parameters. In this paper we address the problem of selection of source parameters based on minimising a bufferbandwidth cost function in the network, for a specified delay QoS Violation Probability. We consider the shaping delay plus first hop multiplexing delay; this is adequate, for example, for n statistically identical packet voice sources being multiplexed at a PBX, or in approaches where the end-to-end delay bound is broken into per hop delay bounds. Our approach yields a leaky bucket rate parameter p’ , and the sum of the shaper buffer and leaky bucket depth (B, + a). We show that, for a fluid source model, for a linear buffer-bandwidth cost function, and for lossless multiplexing, a sustainable rate parameter of p* and burst parameter of 0 yields the minimum cost. We propose and study a stochastic approximation algorithm for on-line estimation of p*. We then use buffer-bandwidth cost considerations to arrive at an optimal leaky bucket depth 0’ > 0 for lossy multiplexing of several statistically identical sources. The computation of o* must be done at the network node. We show, by an example, the improvement in cost that is possible by lossy multiplexing and a positive U*. Keywords-optimal leaky bucket, renegotiation, stochastic approxhation
منابع مشابه
Measurement Based Optimal Source Shaping with a Shaping+Multiplexing Delay Constraint
Most on-line (i.e., not stored) Variable Bit Rate sources would find it difficult to a priori declare the traffic parameters required by a connection admission control strategy. There is thus the problem of measurement based on-line estimation of source parameters. In this paper we address the problem of selection of source parameters based on minimising a bufferbandwidth cost function in the n...
متن کاملAn Enhanced Random Early Marking Algorithm for Internet Flow Control - INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies
AbstructWe propose earlier an optimization based flow control for the Internet called Random Early Mark@ (REM). In this paper we propose and evaluate an enhancement that attempts to sped up the convergence of REM in the face of large feedback delays. REM can be regarded as an implementation of an optimization algorithm in a distributed network. The basic idea is to treat the optimization algori...
متن کاملNear-Optimal Routing Lookups with Bounded Worst Case Performance - INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies
The problem of route address lookup has received much attention recently and several algorithms and data structures for performing address lookups at high speeds have been proposed. In this paper we consider one such data structure a binary search tree built on the intervals created by the routing table prefixes. We wish to exploit the difference in the probabilities with which the various leav...
متن کاملComputing approximate blocking probabilities for a class of all-optical networks - INFOCOM '95. Fourteenth Annual Joint Conference of the IEEE Computer and Communications Societies
W e study a class of all-optical networks using wavelength division multiplexing and wavelength routing in which a connection between a pair of nodes in the network is assigned a path and a wavelength o n that path. Moreover, o n the links of that path n o other connection can share the assigned wavelength. Using a generalized reduced load approximation scheme we calculate the blocking probabil...
متن کاملRouting Dependable Connections With Specified Failure Restoration Guarantees in WDM Networks - INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies
Absnocr--This paper considers the problem of dynamically establishing dependable connections ( D c ~ ~ ~ t i ~ n s ) with peci6ed failure restoration guarantees in wavelength-routed wavelength-division multiplexed (WDM) networks. We call a connection with fault tolerant requirements as a D-connection. We recommend using a pro-active approach to fault tolerance wherein a D-connection is identifl...
متن کامل